无码国产精品一区二区免费16,夫妇交换做爰4,97SE亚洲精品一区,小说区图片区色综合区

integer factorization中文什么意思

發音:

用"integer factorization"造句

整數分解
質因數分解

integer: n. 1.【數學】整數 (opp. fraction)。 ...
integer factorization problem, ifp: 整數分解難題
factorization: 分解為因子; 因式分解; 因數分解; 因素化; 因子分解編制計算程序; 因子分解法
integer: n. 1.【數學】整數 (opp. fraction)。 2.完整的東西，整體。
canonical factorization: 典范因子分解

下載手機詞典可隨時隨地查詞查翻譯

例句與用法

更多例句：下一頁

Information technology - security techniques - digital signature schemes giving message recovery - integer factorization based mechanisms
信息技術.安全技術.使電文恢復的數字簽名方案.基于整數因子分解的機制
Information technology - security techniques - digital signature schemes giving message recovery part 2 : integer factorization based mechanisms
信息技術.保密技術.具有信息恢復功能的數字簽名方案.第2部分:基于整數因子分解的機構
Chun - chih peng and chung - huang yang , " design and implementation for integer factorization and primality testing tools with elliptic curve on windows platforms , " 2007 symposium on cryptography and information security , sasebo , japan , january 2007
張家瀚、楊中皇，支援鏈結機制之標準化時戳實作， 2007知識社群與資訊安全研討會，文化大學， 2007年5月。
Using the idea of secret - sharing and signature - of - knowledge , a new perfect and strong key - insulated signature scheme based on the assumption of integer factorization problem is proposed . the scheme has a low computation in key updating and signing , thus fitting for the mobile devices
( 6 )對簽名系統中的密鑰泄露問題進行了研究，在分析相關技術的基礎上，利用秘密分享和知識簽名，給出了一個完善的強key - insulated簽名方案。
The elliptic curve digital signature algorithm ( ecdsa ) is the elliptic curve analogue of the digital signature algorithm ( dsa ) . it was accepted in 1999 as an ansi standard , and was accepted in 2000 as ieee and nist standards . unlike the ordinary discrete logarithm problem and the integer factorization problem , no subexponential - time is known for the elliptic curve discrete logarithm problem . for this reason , the strength - per - key - bit is substantially greater in an algorithm that uses elliptic curves
橢圓曲線數字簽名算法（ ecdsa ）是數字簽名算法（ dsa ）的橢圓曲線對等。它先后成為ansi ， ieee ， nist和iso的標準，而且其它的一些組織正在考慮成為其標準。不象普通的離散對數問題和因數分解問題，橢圓曲線離散對數問題沒有已知的亞指數算法，所以使用橢圓曲線的算法在密鑰的位強度是足夠高的。

百科釋義

In number theory, integer factorization or prime factorization is the decomposition of a composite number into smaller non-trivial divisors, which when multiplied together equal the original integer.

詳細百科解釋